Accepting splicing systems with permitting and forbidding words
نویسندگان
چکیده
منابع مشابه
Splicing Systems: Accepting Versus Generating
In this paper we propose a condition for rejecting the input word by an accepting splicing system which is defined by a finite set of forbidding words. More precisely, the input word is accepted as soon as a permitting word is obtained provided that no forbidding word has been obtained so far, otherwise it is rejected. Note that in the new variant of accepting splicing system the input word can...
متن کاملUltimately Confluent Rewriting Systems. Parallel Multiset-Rewriting with Permitting or Forbidding Contexts
The aim of this paper is to study the power of parallel multiset-rewriting systems with permitting or forbidding context (or P systems with non-cooperative rules with promoters or inhibitors). The main results obtained say that if we use promoters or inhibitors of weight two, then the systems are computational universal. Moreover, both constructions satisfy a special property we define: they ar...
متن کاملGenerating DNA Code Words Using Forbidding and Enforcing Systems
Research in DNA computing was initiated by Leonard Adleman in 1994 when he solved an instance of an NP-complete problem solely by molecules. DNA code words arose in the attempt to avoid unwanted hybridizations of DNA strands for DNA based computations. Given a set of constraints, generating a large set of DNA strands that satisfy the constraints is an important problem in DNA computing. On the ...
متن کاملNetwork of evolutionary processors with splicing rules and permitting context
In this paper we consider networks of evolutionary processors with splicing rules and permitting context (NEPPS) as language generating and computational devices. Such a network consists of several processors placed on the nodes of a virtual graph and are able to perform splicing (which is a biologically motivated operation) on the words present in that node, according to the splicing rules pre...
متن کاملForbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems
This paper investigates ways to reduce redundancy in forbidding sets for language forbidding-enforcing systems. A language forbidding set disallows combinations of subwords in a word, while permitting the presence of some parts of these combinations. Since a forbidding set is a potentially infinite set of finite sets of words, finding normal forms for forbidding sets is interesting from a combi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2012
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-012-0169-8